The Convex Minorant of the Cauchy Process

نویسنده

  • JEAN BERTOIN
چکیده

We determine the law of the convex minorant (Ms,s�[0,1]) of a real-valued Cauchy process on the unit time interval, in terms of the gamma process. In particular, this enables us to deduce that the paths of M have a continuous derivative, and that the support of the Stieltjes measure dM� has logarithmic dimension one. DOI: https://doi.org/10.1214/ECP.v5-1017 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-79477 Published Version Originally published at: Bertoin, Jean (2000). The convex minorant of the Cauchy process. Electronic Communications in Probability, 5(5):51-55. DOI: https://doi.org/10.1214/ECP.v5-1017 Elect. Comm. in Probab. 5 (2000) 51–55 ELECTRONIC COMMUNICATIONS in PROBABILITY THE CONVEX MINORANT OF THE CAUCHY PROCESS JEAN BERTOIN Laboratoire de Probabilités et Modèles Aléatoires, Université Pierre et Marie Curie, 4, Place Jussieu, F-75252 Paris Cedex 05, France, email: [email protected] submitted Nov. 11, 1999. Final version accepted Jan. 20, 2000. AMS 1991 Subject classification: 60J30 Cauchy process, convex minorant Abstract We determine the law of the convex minorant (Ms, s ∈ [0, 1]) of a real-valued Cauchy process on the unit time interval, in terms of the gamma process. In particular, this enables us to deduce that the paths of M have a continuous derivative, and that the support of the Stieltjes measure dM ′ has logarithmic dimension one.We determine the law of the convex minorant (Ms, s ∈ [0, 1]) of a real-valued Cauchy process on the unit time interval, in terms of the gamma process. In particular, this enables us to deduce that the paths of M have a continuous derivative, and that the support of the Stieltjes measure dM ′ has logarithmic dimension one. For a given real-valued function f defined on some interval I ⊆ R, one calls the convex minorant of f the largest convex function on I which is bounded from above by f . The case when I = [0,∞[ and f is a sample path of Brownian motion has been studied in depth by Groeneboom [11], see also Pitman [13] and Çinlar [6]. In particular, it has been shown in these works that the convex minorant of Brownian motion is almost surely a piecewise linear function on the open interval ]0,∞[, and that the distribution of its derivative can be characterized in terms of a certain process with independent (non-stationary) increments. The more general case when f is a sample path of a Markov process (respectively, a Lévy process) has been considered by Bass [1] (respectively, by Nagasawa and Tanaka [12]). In this note, we carry out a similar study for the Cauchy process on the unit time interval; we shall establish in particular a simple connection with the gamma process which yields several interesting consequences. More precisely, we shall see that the derivative of the convex minorant of the Cauchy process is continuous on ]0, 1[, specify its behavior near the boundary points 0 and 1, and determine the exact Hausdorff measure of the set of points on which it increases. Let (Cs, s ∈ [0, 1]) be a standard one-dimensional Cauchy process and (Ms, s ∈ [0, 1]) denote its convex minorant. The right-derivative (M ′ s, s ∈ [0, 1[) is an increasing process with rightcontinuous paths, and we write μx = inf {s ∈ [0, 1[: M ′ s > x} , x ∈ R

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the Iterative Convex Minorant Algorithm to the Cox Model for Interval Censored Data

The iterative convex minorant ICM algorithm Groeneboom and Wellner is fast in computing the NPMLE of the distribution function for interval censored data without covariates We reformulate the ICM as a generalized gradient projection method GGP which leads to a natural extension to the Cox model It is also easily extended to support the Lasso Tibshirani Some simulation results are also shown For...

متن کامل

A Canonical Process for Estimation of Convex Functions: the “invelope” of Integrated

A process associated with integrated Brownian motion is introduced that characterizes the limit behavior of nonparametric least squares and maximum likelihood estimators of convex functions and convex densities, respectively. We call this process “the invelope” and show that it is an almost surely uniquely defined function of integrated Brownian motion. Its role is comparable to the role of the...

متن کامل

The iterative convex minorant algorithm for nonparametric estimation

The problem of minimizing a smooth convex function over a basic cone in IR n is frequently encountered in nonparametric statistics. For that type of problem we suggest an algorithm and show that this algorithm converges to the solution of the minimization problem.

متن کامل

intcox: Compendium to apply the iterative convex minorant algorithm to interval censored event data

Software that fits a multivariate proportional hazards model to interval censored event data is urgently needed in medical research. Pan describes the use of the iterative convex minorant algorithm (ICM) to achieve this purpose. The implementation of the ICM is presented as well as a bootstrap procedure to derive information for statistical inference on the regression coefficients. An example i...

متن کامل

Extending the Iterative Convex Minorant Algorithm to the Cox Model

The iterative convex minorant (ICM) algorithm (Groeneboom and Wellner, 1992) is fast in computing the NPMLE of the distribution function for interval censored data without covariates. We reformulate the ICM as a generalized gradient projection method (GGP), which leads to a natural extension to the Cox model. It is also easily extended to support the Lasso (Tibshirani, 1996). Some simulation re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016